General results on the decomposition of transitive fuzzy relations

نویسندگان

  • Susana Díaz
  • Bernard De Baets
  • Susana Montes
چکیده

We study the transitivity of fuzzy preference relations, often considered as a fundamental property providing coherence to a decision process. We consider the transitivity of fuzzy relations w.r.t. conjunctors, a general class of binary operations on the unit interval encompassing the class of triangular norms usually considered for this purpose. Having fixed the transitivity of a large preference relation w.r.t. such a conjunctor, we investigate the transitivity of the strict preference and indifference relations of any fuzzy preference structure generated from this large preference relation by means of an (indifference) generator. This study leads to the discovery of two families of conjunctors providing a full characterization of this transitivity. Although the expressions of these conjunctors appear to be quite cumbersome, they reduce to more readily used analytical expressions when we focus our attention on the particular case when the transitivity of the large preference relation is expressed w.r.t. one of the three basic triangular norms (the minimum, the product and the Lukasiewicz triangular norm) while at the same time the generator used for decomposing this large preference relation is also one of these triangular norms. During our discourse, we pay ample attention to the Frank family of triangular norms/copulas. keywords Fuzzy preference relation Transitivity Conjunctor Indifference generator Frank family of t-norms

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy number-valued fuzzy ‎relation

It is well known fact that binary relations are generalized mathematical functions. Contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. Some basic operations on functions such as the inverse and composition are applicable to binary relations as well. Depending on the domain or range or both are fuzzy value fuzzy set, i...

متن کامل

Computationally efficient sup-t transitive closure for sparse fuzzy binary relations

The property of transitivity is one of the most important for fuzzy binary relations, especially in the cases when they are used for the representation of real life similarity or ordering information. As far as the algorithmic part of the actual calculation of the transitive closure of such relations is concerned, works in the literature mainly focus on crisp symmetric relations, paying little ...

متن کامل

Representation of Fuzzy Symmetric Relations

The representation theorem Cor F-transitive fuzzy relations is used to prove that the set of reflexive, symmetric and F -transitive fuzzy relations on a set X, F being an Archimedean t-norm, is dense in the set of Ztransitive relations on X. It is also shown that any similarity relation can be represented as a limit of a sequence of transitive relations with respect to Archimedean t-norms.

متن کامل

Permutable fuzzy consequence and interior operators and their connection with fuzzy relations

Fuzzy operators are an essential tool in many fields and the operation of composition is often needed. In general, composition is not a commutative operation. However, it is very useful to have operators for which the order of composition does not affect the result. In this paper, we analyze when permutability appears. That is, when the order of application of the operators does not change the ...

متن کامل

Fuzzy Neutrosophic Equivalence Relations

This paper introduces the concept of fuzzy neutrosophic equivalence relations and discuss some of their properties. define fuzzy neutrosophic transitive closure and investigate their properties.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • FO & DM

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2010